Random perfect matchings in regular graphs
نویسندگان
چکیده
We prove that in all regular robust expanders G $$ , every edge is asymptotically equally likely contained a uniformly chosen perfect matching M . also show given any fixed or spanning graph N the random variable | ∩ E ( ) \mid M\cap E(N)\mid approximately Poisson distributed. This particular confirms conjecture and question due to Spiro Surya, complements results Kahn Kim who proved vertex matching. Our proofs rely on switching method fact simple walks mix rapidly expanders.
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملRandom Matchings in Regular Graphs
For a simple d-regular graph G, let M be chosen uniformly at random from the set of all matchings of G, and for x ∈ V (G) let p(x) be the probability that M does not cover x. We show that for large d, the p(x)’s and the mean μ and variance σ of |M | are determined to within small tolerances just by d and (in the case of μ and σ) |V (G)|: Theorem For any d-regular graph G, (a) p(x) ∼ d ∀x ∈ V (G...
متن کاملPerfect Matchings in ε-regular Graphs
A super (d, )-regular graph on 2n vertices is a bipartite graph on the classes of vertices V1 and V2, where |V1| = |V2| = n, in which the minimum degree and the maximum degree are between (d− )n and (d+ )n, and for every U ⊂ V1,W ⊂ V2 with |U | ≥ n, |W | ≥ n, | e(U,W ) |U ||W | − e(V1,V2) |V1||V2| | < . We prove that for every 1 > d > 2 > 0 and n > n0( ), the number of perfect matchings in any ...
متن کاملPerfect matchings in regular graphs from eigenvalues
Throughout, G denotes a simple graph of order n (the number of vertices) and size e (the number of edges). The eigenvalues of G are the eigenvalues λi 1 Research partially supported by an NSERC postdoctoral fellowship. 2 Research supported by the Natural Sciences and Engineering Research Council of Canada. Email addresses: [email protected] (Sebastian M. Cioabă), [email protected] (D...
متن کاملPerfect Matchings in Õ(n) Time in Regular Bipartite Graphs
We consider the well-studied problem of finding a perfect matching in d-regular bipartite graphs with 2n vertices and m = nd edges. While the best-known algorithm for general bipartite graphs (due to Hopcroft and Karp) takes O(m √ n) time, in regular bipartite graphs, a perfect matching is known to be computable in O(m) time. Very recently, the O(m) bound was improved to O(min{m, n 2.5 lnn d })...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2023
ISSN: ['1042-9832', '1098-2418']
DOI: https://doi.org/10.1002/rsa.21172